Cryptanalysis of the Modified Version of the Hash Function Proposed at PKC'98
نویسندگان
چکیده
In the conference PKC’98, Shin et al. proposed a dedicated hash function of the MD family. In this paper, we study the security of Shin’s hash function. We analyze the property of the Boolean functions, the message expansion, and the data dependent rotations of the hash function. We propose a method for finding the collisions of the modified Shin’s hash function and show that we can find collisions with probability 2.
منابع مشابه
Full-Round Differential Attack on the Original Version of the Hash Function Proposed at PKC'98
Shin et al.[4] proposed a new hash function with 160-bit output length at PKC’98. Recently, at FSE 2002, Han et al.[5] cryptanalyzed the hash function proposed at PKC’98 and suggested a method finding a collision pair with probability 2−30, supposing that boolean functions satisfy the SAC(Strict Avalanche Criterion). This paper improves their attack and shows that we can find a collision pair f...
متن کاملImproved Collision Attack on the Hash Function Proposed at PKC'98
In this article, we present an improved collision attack on the hash function proposed by Shin et al. at PKC’98. The attack has a complexity of about 2 hash computations, while the previous attack of Chang et al. presented at SAC 2002 has a complexity of about 2 hash computations. In the analysis of the hash function we combined existing approaches with recent results in cryptanalysis of hash f...
متن کاملCryptanalysis of Some Hash Functions Based on Block Ciphers and Codes
At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: encryptions are necessary to find a collision, where and are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملCryptanalysis of Grindahl
Due to recent breakthroughs in hash functions cryptanalysis, some new hash schemes have been proposed. GRINDAHL is a novel hash function, designed by Knudsen, Rechberger and Thomsen and published at FSE 2007. It has the particularity that it follows the RIJNDAEL design strategy, with an efficiency comparable to SHA-256. This paper provides the first cryptanalytic work on this new scheme. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002